Partition of Unstructured Finite Element Meshes by a Multilevel Approach
نویسندگان
چکیده
We consider the topic of partitioning unstructured finite element meshes by a class of multilevel graph partitioning algorithms. Two issues are studied, where the first issue concerns the coarsening phase in such multilevel graph partitioning algorithms. In particular, we propose a new heuristic for matching the vertices of a graph during the coarsening phase. We compare our heuristic with two other known matching heuristics in respect of matching ratio and quality of the final partition. As the second issue of the paper, we look at the relation between the parallel efficiency of finite element computation and different aspects of the partition quality.
منابع مشابه
How to Generate Local Refinements of Unstructured Tetrahedral Meshes Satisfying a Regularity Ball Condition
Theory of adaptive procedures in the finite element method for solving differential equations began in 1976 with Babuška's pioneering article [1]. Local refinements of FE-meshes are usually done near those points, where singularities or oscillations of the solution (and its derivatives) occur. Various error estimators give us information about the regions where these refinements are actually ne...
متن کاملA unified framework of multi-objective cost functions for partitioning unstructured finite element meshes
Good performance of parallel finite element computations on unstructured meshes requires high-quality mesh partitioning. Such a decomposition task is normally done by a graph-based partitioning approach. However, the main shortcoming of graph partitioning algorithms is that minimizing the so-called edge cut is not entirely the same as minimizing the communication overhead. This paper thus propo...
متن کاملMultilevel Method Based on Non-nested Meshes
Partial differential equations in complex domains are very flexibly discretized by 7 finite elements with unstructured meshes. For such problems, the challenging task to construct 8 coarse level spaces for efficient multilevel preconditioners can in many cases be solved by a 9 semi-geometric approach, which is based on a hierarchy of non-nested meshes. In this paper, 10 we investigate the conne...
متن کاملPartitioning unstructured meshes using a distributed optimization model
Large meshes computations arise in many large-scale scientific and engineering problems, including finite volume methods for computational fluid dynamics, and finite element methods for structure analysis. If these meshes have to be solved efficiently on distributed memory parallel processors, a partitioning strategy should be designed so that on the one hand, processors have approximately equa...
متن کاملAdaptive Numerical Treatment of Elliptic Systems on Manifolds
Adaptive multilevel finite element methods are developed and analyzed for certain elliptic systems arising in geometric analysis and general relativity. This class of nonlinear elliptic systems of tensor equations on manifolds is first reviewed, and then adaptive multilevel finite element methods for approximating solutions to this class of problems are considered in some detail. Two a posterio...
متن کامل